Dening Finitely Supported Mathematics over Sets with Atoms
نویسندگان
چکیده
This paper presents some steps of defining a finitely supported mathematics by using sets with atoms. Such a mathematics generalizes the classical Zermelo-Fraenkel mathematics, and represents an appropriate framework to work with (infinite) structures in terms of finitely supported objects. We focus on the techniques of translating the Zermelo-Fraenkel results to this finitely supported mathematics over
منابع مشابه
Separated finitely supported $Cb$-sets
The monoid $Cb$ of name substitutions and the notion of finitely supported $Cb$-sets introduced by Pitts as a generalization of nominal sets. A simple finitely supported $Cb$-set is a one point extension of a cyclic nominal set. The support map of a simple finitely supported $Cb$-set is an injective map. Also, for every two distinct elements of a simple finitely supported $Cb$-set, there exists...
متن کاملFUZZY GOULD INTEGRABILITY ON ATOMS
In this paper we study the relationships existing between total measurability in variation and Gould type fuzzy integrability (introduced and studied in [21]), giving a special interest on their behaviour on atoms and on finite unions of disjoint atoms. We also establish that any continuous real valued function defined on a compact metric space is totally measurable in the variation of a regula...
متن کاملLattice of full soft Lie algebra
In this paper, we study the relation between the soft sets and soft Lie algebras with the lattice theory. We introduce the concepts of the lattice of soft sets, full soft sets and soft Lie algebras and next, we verify some properties of them. We prove that the lattice of the soft sets on a fixed parameter set is isomorphic to the power set of a ...
متن کاملNominal renaming sets ( technical report )
Nominal techniques are based on the idea of sets with a finitelysupported atoms-permutation action. In this paper we consider the idea of sets with a finitely-supported atoms-renaming action (renamings can identify atoms; permutations cannot). We show that these exhibit many of the useful qualities found in traditional nominal techniques; an elementary sets-based presentation, inductive datatyp...
متن کاملGeneralized Multisets: From ZF to FSM
We study generalized multisets (multisets that allow possible negative multiplicities) both in the Zermelo-Fraenkel framework and in the finitely supported mathematics. We extend the notion of generalized multiset over a finite alphabet, and we replace it by the notion of algebraically finitely supported generalized multiset over a possibly infinite alphabet. We analyze the correspondence betwe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015